Distributed and Fault-Tolerant Routing for Borel Cayley Graphs
نویسندگان
چکیده
منابع مشابه
Representations of Borel Cayley Graphs
There is a continuing search for dense (6, D) interconnection graphs, that is, regular, bidirectional, degree 6 graphs with diameter D and having a large number of nodes. Cayley graphs formed by the Borel subgroup currently contribute to some of the densest (6 = 4, D) graphs for a range of D [l]. However, the group theoretic representation of these graphs makes the development of ef i cient rou...
متن کاملCluster Fault-tolerant Routing in Pancake Graphs
In this paper, we propose an O(n) algorithm that finds a fault-free path between any pair of non-faulty nodes in an n-pancake graph with n−2 faulty clusters whose diameters are at most 2. The lengths of the paths obtained by our algorithm are at most d◦(Pn)+7 where d◦(Pn) = b5(n+1)/3c represents the upper bound of the diameter of Pn given by Gates and Papadimitriou. According to the computer ex...
متن کاملFault-tolerant routing in burnt pancake graphs
Recently, researches of parallel distributed computation are getting more important. Especially, massively parallel systems are studied with enthusiasm, and many topologies have been proposed. Since multiple faulty elements are expected in a massively parallel system, fault-tolerant routing is also studied eagerly for communication avoiding the faulty elements [4,6,8]. In this study, we focus o...
متن کاملFault Tolerant Ring Embedding in tetravalent Cayley Network Graphs
Our purpose in the present paper is to investigate the structural properties of the newly proposed Cayley networks of constant node degree 4. We show that the graph contains rings of maximal length in presence of multiple faults. Our results provide further evidence to the usefulness and robustness of these network graphs.
متن کاملDistributed Fault-tolerant Routing in a Hypercube
A ABSTRACT connected hypercube containing faulty nodes/links is called an injured hypercube, f whereas a hypercube without faulty components is called a healthy hypercube. To allow non-aulty nodes in an injured hypercube to communicate with one another, each hypercube node has to be equipped with enough information so as to make correct routing decisions, and 1 y c update the information whenev...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Distributed Sensor Networks
سال: 2012
ISSN: 1550-1477,1550-1477
DOI: 10.1155/2012/124245